In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...

A novel algorithm for one machine scheduling to minimize total weighted earliness and tardiness using particle swarm optimization is proposed. Existing techniques face challenges such as job size limitations increase in computational time and inaccurate solutions. To overcome these challenges the proposed work implements Meta-Heuristic based particle swarm optimization to optimize the total wei...

We consider the problem of determining the allocation of demand from different customer orders to production batches and the schedule of resulting batches to minimize the total weighted earliness and tardiness penalties in context of batch chemical processing. The problem is formulated as a mixed-integer nonlinear programming model. An iterative heuristic procedure that makes use of the network...

In many manufacturing systems, jobs that are completed early are held as finished-goods inventory until their due-dates, and hence we incur earliness costs. Similarly, jobs that are completed after their due-dates incur penalty. The objective in such situations would, therefore, be to meet the due-dates of the respective jobs as closely as possible, and consequently minimize the sum of earlines...

In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing a...

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

In this paper we compare simulated annealing and tabu search approaches to a single machine common due date assignment and scheduling problem with jobs available at different times. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs.

In the present work, an industrial case study has been considered for multi-objective flow shop scheduling problem including the sequence dependent set up time. The multi-objectives include the minimization of sum of total weighted squared tardiness, total weighted squared earliness, makespan and number of tardy jobs. Industries can select the optimal sequence with respect to required objective...